Regular Languages Are Testable with a Constant Number of Queries
نویسندگان
چکیده
We continue the study of combinatorial property testing, initiatedby Goldreich, Goldwasser and Ron in [7]. The subject of this paper is testing regular languages. Our main result is as follows. For a regular language L ∈ {0, 1}∗ and an integer n there exists a randomized algorithm which always accepts a word w of length n if w ∈ L, and rejects it with high probability if w has to be modified in at least ǫn positions to create a word in L. The algorithm queries Õ(1/ǫ) bits of w. This query complexity is shown to be optimal up to a factor poly-logarithmic in 1/ǫ. We also discuss testability of more complex languages and show, in particular, that the query complexity required for testing contextfree languages cannot be bounded by any function of ǫ. The problem of testing regular languages can be viewed as a part of a very general approach, seeking to probe testability of properties defined by logical means.
منابع مشابه
ω - regular Languages are Testable with a Constant Number of Queries ?
We continue the study of combinatorial property testing. For a property ψ, an ε-test for ψ, for 0 < ε ≤ 1, is a randomized algorithm that given an input x, returns “yes” if x satisfies ψ, and returns “no” with high probability if x is ε-far from satisfying ψ, where ε-far essentially means that an ε-fraction of x needs to be changed in order for it to satisfy ψ. In [AKNS99], Alon et al. show tha...
متن کاملLanguages that are Recognized by Simple Counter Automata are not necessarily Testable
Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input f , one wants to decide whether f satisfies the property or is ‘far’ from satisfying the property. It has been shown that regular languages are testable, and that there exist context free language which are not testable. We show that there exists a language that is accept...
متن کاملLocally Testable Codes and PCPs of Almost - Linear Length ( Preliminary
Locally testable codes are error-correcting codes that admit very eecient codeword tests. Speciically, using a constant number of (random) queries, non-codewords are rejected with probability proportional to their distance from the code. Locally testable codes are believed to be the combinatorial core of PCPs. However, the relation is less immediate than commonly believed. Nevertheless, we show...
متن کاملTesting of Functions that have small width Branching Programs
Combinatorial property testing, initiated formally by Goldreich, Goldwasser and Ron in [11], and inspired by Rubinfeld and Sudan [13], deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x has the property or is being ’far’ from having the property. The main result here is that if G = fg : f0; 1gn ! f0; 1gg is a family of ...
متن کاملTesting Membership in Languages that Have Small Width Branching Programs
Combinatorial property testing, initiated formally by Goldreich, Goldwasser, and Ron in [J. ACM, 45 (1998), pp. 653–750] and inspired by Rubinfeld and Sudan [SIAM J. Comput., 25 (1996), pp. 252–271], deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x has the property or is “far” from having the property. The main result...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 329 شماره
صفحات -
تاریخ انتشار 1999